Submodular Memetic Approximation for Multiobjective Parallel Test Paper Generation
نویسندگان
چکیده
منابع مشابه
Collective Biobjective Optimization Algorithm for Parallel Test Paper Generation
Parallel Test Paper Generation (k-TPG) is a biobjective distributed resource allocation problem, which aims to generate multiple similarly optimal test papers automatically according to multiple userspecified criteria. Generating high-quality parallel test papers is challenging due to its NP-hardness in maximizing the collective objective functions. In this paper, we propose a Collective Biobje...
متن کاملA Memetic Algorithm for whole test suite generation
The generation of unit-level test cases for structural code coverage is a task well-suited to Genetic Algorithms. Method call sequences must be created that construct objects, put them into the right state and then execute uncovered code. However, the generation of primitive values, such as integers and doubles, characters that appear in strings, and arrays of primitive values, are not so strai...
متن کاملTri-modal under-approximation for test generation
This paper presents a method for under-approximating behavioural models with the guarantee that the abstract paths can be instantiated as executions of the models. This allows a model-based testing approach to operate on an abstraction of an infinite or very large behavioural model. We characterize the abstract transitions as may, must+ or must-. This allows us to benefit from Thomas Ball’s res...
متن کاملOptimized Test Suite Generation using Memetic Algorithm: A Survey
For developing successful software, testing is a very important component. In software testing, providing input, executes it and check expected output. Many techniques which automatically produce inputs have been proposed over the years, and today are able to produce test suites with high code coverage. In software testing a common scenario is that test data are generated and a tester manually ...
متن کاملFPT Approximation Schemes for Maximizing Submodular Functions
We investigate the existence of approximation algorithms for maximization of submodular functions, that run in fixed parameter tractable (FPT) time. Given a non-decreasing submodular set function v : 2 → R the goal is to select a subset S of K elements from X such that v(S) is maximized. We identify three properties of set functions, referred to as p-separability properties, and we argue that m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cybernetics
سال: 2017
ISSN: 2168-2267,2168-2275
DOI: 10.1109/tcyb.2016.2552079